MOSEL: A sound and efficient tool for M2L(Str)KELB, P; MARGARIA, T; MENDLER, M et al.Lecture notes in computer science. 1997, pp 448-451, issn 0302-9743, isbn 3-540-63166-6Conference Paper

Modulo-counting quantifiers over finite treesPOTTHOFF, A.Theoretical computer science. 1994, Vol 126, Num 1, pp 97-112, issn 0304-3975Conference Paper

A uniform method for proving lower bounds on the computational complexity of logical theoriesCOMPTON, K. J; WARD HENSON, C.Annals of pure and applied logic. 1990, Vol 48, Num 1, pp 1-79, issn 0168-0072, 79 p.Article